Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
نویسندگان
چکیده
منابع مشابه
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. A complex network model gaining considerable popularity builds random hyperbolic graphs, generated by distributing points within a disk in the hyperbolic plane and then adding edges between points with a probability depending on their...
متن کاملGenerating Random Hyperbolic Graphs in Subquadratic Time
Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they simplify complex network research regarding data sharing, reproducibility, and scalability studies. Random hyperbolic graphs are a very promising family of geometric graphs with unit-disk neighborhood in the hyperbolic plane. Prev...
متن کاملSublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O (√ n · log n · √ log∗ n ) , that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic algorithm for solving a large class of search problems called Local Search, LS. LS is defined by us as...
متن کاملSublinear Time and Space Algorithms 2016B – Lecture 7 Sublinear-Time Algorithms for Sparse Graphs∗
Problem definition: Input: A graph represented (say) as the adjacency list for each vertex (or even just the degree of each vertex) Goal: Compute the average degree (equiv. number of edges) Concern: Seems to be impossible e.g. if all degrees ≤ 1, except possibly for a few vertices whose degree is about n. Theorem 1 [Feige, 2004]: There is an algorithm that estimates the average degree d of a co...
متن کاملHyperbolic grids and discrete random graphs
We present an efficient algorithm for computing distances in hyperbolic grids. We apply this algorithm to work efficiently with a discrete variant of the hyperbolic random graph model. This model is gaining popularity in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. We present experimental results conducted on real world netwo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2018
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3195635